Simple Counterexamples to the Local-global Principle

نویسندگان

  • W. AITKEN
  • F. LEMMERMEYER
چکیده

After Hasse had found the first example of a Local-Global principle in the 1920s by showing that a quadratic form in n variables represented 0 in rational numbers if and only if it did so in every completion of the rationals, mathematicians investigated whether this principle held in other situations. Among the first counterexamples to the Hasse principle were curves of genus 1 constructed by Lind and Reichardt: these were curves without rational points but with points in every completion of Q. In this article we will show that the technique of rational parametrization of conics is powerful enough to derive Reichardt’s result.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Euler’s Trick and Second 2-descents

In this article we present an elementary method for investigating the solvability of certain quartic diophantine equations (in modern language: we show how to perform the second 2-descent on certain elliptic curves using only the arithmetic of integers). Our method is based on an idea of Euler and seems to be related to unpublished work of Mordell. 1. Hasse’s Local-Global Principle One of the s...

متن کامل

Augmented Downhill Simplex a Modified Heuristic Optimization Method

Augmented Downhill Simplex Method (ADSM) is introduced here, that is a heuristic combination of Downhill Simplex Method (DSM) with Random Search algorithm. In fact, DSM is an interpretable nonlinear local optimization method. However, it is a local exploitation algorithm; so, it can be trapped in a local minimum. In contrast, random search is a global exploration, but less efficient. Here, rand...

متن کامل

Lifting Global Representations with Local Properties

Let k be a global field, with Galois group Gk and Weil group Wk relative to a choice of separable closure ks/k. Let Γ be either Gk or Wk, and H a linear algebraic group over F = C or Qp with p 6= char(k). Let ρ : Γ→ H(F ) be a (continuous) representation, always understood to be ramified at only finitely many places (as is automatic for commutative H, but not for H = GL2 with k = Q and F = Qp, ...

متن کامل

Decomposable Quadratic Forms and Involutions

In his book on compositions of quadratic forms, Shapiro asks whether a quadratic form decomposes as a tensor product of quadratic forms when its adjoint involution decomposes as a tensor product of involutions on central simple algebras. We give a positive answer for quadratic forms defined over local or global fields and produce counterexamples over fields of rational fractions in two variable...

متن کامل

Improvement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm

Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005